منابع مشابه
Polynomial Foliations of R 2
In 1940 Kaplan [14, 15] published two large papers on regular families of curves filling the plane, following previous ideas of Whitney [26]. A family of curves is called regular if it is locally homeomorphic with parallel lines. He proved that each curve of a regular family filling the plane is a homeomorphic line tending to infinity in both directions. A natural example of generating (orienta...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملPlanar Nonautonomous Polynomial Equations Iv . Nonholomorphic Case
We give a few sufficient conditions for the existence of periodic solutions of the equation ż = Pn j=0 aj(t)z j − Pr k=1 ck(t)z k where n > r and aj ’s, ck’s are complex valued. We prove the existence of one up to two periodic solutions.
متن کاملContractions of Planar Graphs in Polynomial Time
We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological minors of embedded (plane) graphs and show that a plane graph H is an embedded contraction of a plane graph G, if and only if, the dual of H is an embedded topological minor of the dual of G. We show how to reduce finding embedded...
متن کاملLow Polynomial Exclusion of Planar Graph Patterns
The celebrated grid exclusion theorem states that for every h-vertex planar graph H , there is a constant ch such that if a graph G does not contain H as a minor then G has treewidth at most ch. We are looking for patterns of H where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel (ch = O(h)), the double wheel (ch = O(h 2 ·...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1980
ISSN: 0002-9939
DOI: 10.2307/2042516